Background Knowledge in Concept Graphs

نویسنده

  • Frithjof Dau
چکیده

Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new research field termed Contextual Logic, a mathematical theory of this logic is elaborated. Concepts have already been mathematically elaborated by Formal Concept Analysis. Judgements and Conclusions can be expressed by so-called Concept Graphs, which are built upon families of formal contexts. There are two approaches to concept graphs: A semantical approach, which investigates the theory of concept graphs in an algebraic manner, and a logical approach, which focuses on derivation rules for concept graphs, relying on a separation between syntax and semantics. In [26], Wille introduced two forms of complex implications (object implications and concept implications) to the semantical approach. In this paper it is investigated how these implications can be incorporated into the logical approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattices of Triadic Concept Graphs

Triadic concept graphs have been introduced as a mathema-tization of conceptual graphs with subdivision. In this paper it is shown that triadic concept graphs of a triadic power context family always form a complete lattice with respect to the generalization order. For stating this result, a clariication of the notion of generalization is needed. It turns out that the generalization order may b...

متن کامل

Simple Conceptual Graphs and Simple Concept Graphs

Sowa’s Conceptual Graphs and Formal Concept Analysis have been combined into another knowledge representation formalism named Concept Graphs. In this paper, we compare Simple Conceptual Graphs with Simple Concept Graphs, by successively studying their different syntaxes, semantics, and entailment calculus. We show that these graphs are almost identical mathematical objects, have equivalent sema...

متن کامل

Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs

In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...

متن کامل

On Generalized Coprime Graphs

Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.

متن کامل

Simple Concept Graphs: A Logic Approach

Conceptual Graphs and Formal Concept Analysis are combined by developing a logical theory for concept graphs of relational contexts. Therefore, concept graphs are introduced as syntactical constructs , and their semantics is deened based on relational contexts. For this contextual logic, a sound and complete system of inference rules is presented and a standard graph is introduced that entails ...

متن کامل

Fuzzy Forcing Set on Fuzzy Graphs

The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004